edge connectivity

edge connectivity
связность линий в сети (определяется как наименьшее число линий между узлами связи, которые необходимо исключить, чтобы сеть распалась на несколько изолированных друг от друга фрагментов или подсетей)

Англо-русский словарь промышленной и научной лексики. 2014.

Смотреть что такое "edge connectivity" в других словарях:

• Connectivity (graph theory) — In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) which need to be removed to disconnect the remaining nodes from each other[1]. It is… …   Wikipedia

• Recording at the edge — is the concept of taking audio/video from a camera, and storing it at the edge of the Ethernet network instead of transporting it across the network to a centralized recording facility such as a Network Video Recorder.Recording at the Edge is a… …   Wikipedia

• Winged edge — The winged edge data structure is a commonly used data representation used to describe polygon models in computer graphics. It explicitly describes the geometry and topology of faces, edges, and vertices when three or more surfaces come together… …   Wikipedia

• K-edge-connected graph — In graph theory, a graph G with edge set E(G) is said to be k edge connected if G setminus X is connected for all X subseteq E(G) with left| X ight| < k. In plain English, a graph is k edge connected if the graph remains connected when you delete …   Wikipedia

• Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… …   Wikipedia

• Menger's theorem — In the mathematical discipline of graph theory and related areas, Menger s theorem is a basic result about connectivity in finite undirected graphs. It was proved for edge connectivity and vertex connectivity by Karl Menger in 1927. The edge… …   Wikipedia

• Minimum spanning tree — The minimum spanning tree of a planar graph. Each edge is labeled with its weight, which here is roughly proportional to its length. Given a connected, undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all… …   Wikipedia

• Bridge (graph theory) — A graph with 6 bridges (highlighted in red) An undirected connected graph with no cut …   Wikipedia

• List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… …   Wikipedia

• Список терминов, относящихся к алгоритмам и структурам данных —   Это служебный список статей, созданный для координации работ по развитию темы.   Данное предупреждение не устанавливается на информационные списки и глоссарии …   Википедия

• Список терминов — Список терминов, относящихся к алгоритмам и структурам данных   Это сл …   Википедия

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»